A Note on NTU convexity and Population Monotonic Allocation Schemes
نویسنده
چکیده
منابع مشابه
Population Monotonic Allocation Schemes for Games with Externalities
This paper provides the conditions for a game with externalities to have a population monotonic allocation scheme (PMAS). We observe that the convexity defined by Hafalir (2007) does not guarantee the existence of a PMAS in the presence of externalities. We introduce a new convexity and show that while our convexity is not a stronger condition than Hafalir (2007)’s, it is a sufficient condition...
متن کاملLink Monotonic Allocation Schemes
A network is a graph where the nodes represent players and the links represent bilateral interaction between the players. A reward game assigns a value to every network on a fixed set of players. An allocation scheme specifies how to distribute the worth of every network among the players. This allocation scheme is link monotonic if extending the network does not decrease the payoff of any play...
متن کاملSingle NTU-value solutions¤
We propose a variation of the non-cooperative bargaining model for n-person games in coalitional form, introduced in Hart and Mas-Colell (1996). This strategic game implements, in the limit, a new NTU-value for the class of monotonic games. This value coincides with the Consistent NTU-value (Maschler and Owen,1989) for hyperplane games, and with the Shapley value for TU games (Shapley, 1953). T...
متن کاملObligation rules for minimum cost spanning tree situations and their monotonicity properties
We introduce the class of Obligation rules for minimum cost spanning tree situations. The main result of this paper is that such rules are cost monotonic and induce also population monotonic allocation schemes. Another characteristic of Obligation rules is that they assign to a minimum cost spanning tree situation a vector of cost contributions which can be obtained as product of a double stoch...
متن کاملConvex and exact games with non-transferable utility
We generalize exactness to games with non-transferable utility (NTU). In an exact game for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We study five generalizations of convexity in the NTU setting. We show that each of ordinal, coalition merge, individual merge and marginal convexity can be unifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IGTR
دوره 5 شماره
صفحات -
تاریخ انتشار 2003